We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 9e1a2b2 commit fe20c8dCopy full SHA for fe20c8d
1 file changed
Mathlib/Combinatorics/SimpleGraph/Extremal/Zarankiewicz.lean
@@ -137,10 +137,9 @@ theorem two_mul_extremalNumber_le_zarankiewicz_symm [Nonempty α] [Nonempty β]
137
· simp_rw [mem_filter, mem_univ, true_and]
138
refine ⟨bipartiteDoubleCover_le, ?_⟩
139
contrapose! h
140
- refine bipartiteDoubleCover_completeBipartiteGraph_isContained <|
141
- h.trans' ⟨Iso.toCopy ?_⟩
+ refine completeBipartiteGraph_isContained_bipartiteDoubleCover.mp <| h.trans' ⟨Iso.toCopy ?_⟩
142
exact completeBipartiteGraph.congr
143
(Fintype.equivFinOfCardEq rfl) (Fintype.equivFinOfCardEq rfl)
144
- · convert bipartiteDoubleCover_card_edgeFinset.symm.le
+ · convert card_edgeFinset_bipartiteDoubleCover.symm.le
145
146
end SimpleGraph
0 commit comments