Theorem refssfne 37324

Description: A cover is a refinement iff it is a subcover of something which is both finer and a refinement. (Contributed by Jeff Hankins, 18-Jan-2010.) (Revised by Thierry Arnoux, 3-Feb-2020.)

Hypotheses

Ref	Expression
refssfne.1	⊢ 𝑋 = ∪ 𝐴
refssfne.2	⊢ 𝑌 = ∪ 𝐵

Assertion

Ref	Expression
refssfne	⊢ (𝑋 = 𝑌 → (𝐵Ref𝐴 ↔ ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))

Distinct variable groups:   𝐴,𝑐   𝐵,𝑐   𝑋,𝑐   𝑌,𝑐

Proof of Theorem refssfne

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		refrel 23857	. . . . . . 7 ⊢ Rel Ref
2	1	brrelex2i 5712	. . . . . 6 ⊢ (𝐵Ref𝐴 → 𝐴 ∈ V)
3	2	adantl 487	. . . . 5 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐴 ∈ V)
4	1	brrelex1i 5711	. . . . . 6 ⊢ (𝐵Ref𝐴 → 𝐵 ∈ V)
5	4	adantl 487	. . . . 5 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐵 ∈ V)
6		unexg 7784	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ∪ 𝐵) ∈ V)
7	3, 5, 6	syl2anc 596	. . . 4 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝐴 ∪ 𝐵) ∈ V)
8		ssun2 4180	. . . . . 6 ⊢ 𝐵 ⊆ (𝐴 ∪ 𝐵)
9	8	a1i 11	. . . . 5 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐵 ⊆ (𝐴 ∪ 𝐵))
10		ssun1 4179	. . . . . . 7 ⊢ 𝐴 ⊆ (𝐴 ∪ 𝐵)
11	10	a1i 11	. . . . . 6 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐴 ⊆ (𝐴 ∪ 𝐵))
12		eqimss2 3972	. . . . . . . . 9 ⊢ (𝑋 = 𝑌 → 𝑌 ⊆ 𝑋)
13	12	adantr 486	. . . . . . . 8 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝑌 ⊆ 𝑋)
14		ssequn2 4190	. . . . . . . 8 ⊢ (𝑌 ⊆ 𝑋 ↔ (𝑋 ∪ 𝑌) = 𝑋)
15	13, 14	sylib 221	. . . . . . 7 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑋 ∪ 𝑌) = 𝑋)
16	15	eqcomd 2769	. . . . . 6 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝑋 = (𝑋 ∪ 𝑌))
17		refssfne.1	. . . . . . 7 ⊢ 𝑋 = ∪ 𝐴
18		refssfne.2	. . . . . . . . 9 ⊢ 𝑌 = ∪ 𝐵
19	17, 18	uneq12i 4168	. . . . . . . 8 ⊢ (𝑋 ∪ 𝑌) = (∪ 𝐴 ∪ ∪ 𝐵)
20		uniun 4893	. . . . . . . 8 ⊢ ∪ (𝐴 ∪ 𝐵) = (∪ 𝐴 ∪ ∪ 𝐵)
21	19, 20	eqtr4i 2789	. . . . . . 7 ⊢ (𝑋 ∪ 𝑌) = ∪ (𝐴 ∪ 𝐵)
22	17, 21	fness 37315	. . . . . 6 ⊢ (((𝐴 ∪ 𝐵) ∈ V ∧ 𝐴 ⊆ (𝐴 ∪ 𝐵) ∧ 𝑋 = (𝑋 ∪ 𝑌)) → 𝐴Fne(𝐴 ∪ 𝐵))
23	7, 11, 16, 22	syl3anc 1399	. . . . 5 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → 𝐴Fne(𝐴 ∪ 𝐵))
24		elun 4155	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
25		ssid 3935	. . . . . . . . . . 11 ⊢ 𝑥 ⊆ 𝑥
26		sseq2 3939	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝑥 ⊆ 𝑦 ↔ 𝑥 ⊆ 𝑥))
27	26	rspcev 3580	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ⊆ 𝑥) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
28	25, 27	mpan2 704	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
29	28	a1i 11	. . . . . . . . 9 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
30		refssex 23860	. . . . . . . . . . 11 ⊢ ((𝐵Ref𝐴 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
31	30	ex 418	. . . . . . . . . 10 ⊢ (𝐵Ref𝐴 → (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
32	31	adantl 487	. . . . . . . . 9 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
33	29, 32	jaod 873	. . . . . . . 8 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
34	24, 33	biimtrid 245	. . . . . . 7 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝑥 ∈ (𝐴 ∪ 𝐵) → ∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦))
35	34	ralrimiv 3157	. . . . . 6 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ∀𝑥 ∈ (𝐴 ∪ 𝐵)∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)
36	21, 17	isref 23858	. . . . . . 7 ⊢ ((𝐴 ∪ 𝐵) ∈ V → ((𝐴 ∪ 𝐵)Ref𝐴 ↔ (𝑋 = (𝑋 ∪ 𝑌) ∧ ∀𝑥 ∈ (𝐴 ∪ 𝐵)∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)))
37	7, 36	syl 18	. . . . . 6 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ((𝐴 ∪ 𝐵)Ref𝐴 ↔ (𝑋 = (𝑋 ∪ 𝑌) ∧ ∀𝑥 ∈ (𝐴 ∪ 𝐵)∃𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦)))
38	16, 35, 37	mpbir2and 726	. . . . 5 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝐴 ∪ 𝐵)Ref𝐴)
39	9, 23, 38	jca32 525	. . . 4 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → (𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴)))
40		sseq2 3939	. . . . . 6 ⊢ (𝑐 = (𝐴 ∪ 𝐵) → (𝐵 ⊆ 𝑐 ↔ 𝐵 ⊆ (𝐴 ∪ 𝐵)))
41		breq2 5110	. . . . . . 7 ⊢ (𝑐 = (𝐴 ∪ 𝐵) → (𝐴Fne𝑐 ↔ 𝐴Fne(𝐴 ∪ 𝐵)))
42		breq1 5109	. . . . . . 7 ⊢ (𝑐 = (𝐴 ∪ 𝐵) → (𝑐Ref𝐴 ↔ (𝐴 ∪ 𝐵)Ref𝐴))
43	41, 42	anbi12d 644	. . . . . 6 ⊢ (𝑐 = (𝐴 ∪ 𝐵) → ((𝐴Fne𝑐 ∧ 𝑐Ref𝐴) ↔ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴)))
44	40, 43	anbi12d 644	. . . . 5 ⊢ (𝑐 = (𝐴 ∪ 𝐵) → ((𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)) ↔ (𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴))))
45	44	spcegv 3555	. . . 4 ⊢ ((𝐴 ∪ 𝐵) ∈ V → ((𝐵 ⊆ (𝐴 ∪ 𝐵) ∧ (𝐴Fne(𝐴 ∪ 𝐵) ∧ (𝐴 ∪ 𝐵)Ref𝐴)) → ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))
46	7, 39, 45	sylc 66	. . 3 ⊢ ((𝑋 = 𝑌 ∧ 𝐵Ref𝐴) → ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)))
47	46	ex 418	. 2 ⊢ (𝑋 = 𝑌 → (𝐵Ref𝐴 → ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))
48		vex 3458	. . . . . . . 8 ⊢ 𝑐 ∈ V
49	48	ssex 5286	. . . . . . 7 ⊢ (𝐵 ⊆ 𝑐 → 𝐵 ∈ V)
50	49	ad2antrl 741	. . . . . 6 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵 ∈ V)
51		simprl 783	. . . . . 6 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵 ⊆ 𝑐)
52		simpl 488	. . . . . . 7 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑋 = 𝑌)
53		eqid 2763	. . . . . . . . . 10 ⊢ ∪ 𝑐 = ∪ 𝑐
54	53, 17	refbas 23859	. . . . . . . . 9 ⊢ (𝑐Ref𝐴 → 𝑋 = ∪ 𝑐)
55	54	adantl 487	. . . . . . . 8 ⊢ ((𝐴Fne𝑐 ∧ 𝑐Ref𝐴) → 𝑋 = ∪ 𝑐)
56	55	ad2antll 742	. . . . . . 7 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑋 = ∪ 𝑐)
57	52, 56	eqtr3d 2800	. . . . . 6 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑌 = ∪ 𝑐)
58	18, 53	ssref 23861	. . . . . 6 ⊢ ((𝐵 ∈ V ∧ 𝐵 ⊆ 𝑐 ∧ 𝑌 = ∪ 𝑐) → 𝐵Ref𝑐)
59	50, 51, 57, 58	syl3anc 1399	. . . . 5 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵Ref𝑐)
60		simprrr 794	. . . . 5 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝑐Ref𝐴)
61		reftr 23863	. . . . 5 ⊢ ((𝐵Ref𝑐 ∧ 𝑐Ref𝐴) → 𝐵Ref𝐴)
62	59, 60, 61	syl2anc 596	. . . 4 ⊢ ((𝑋 = 𝑌 ∧ (𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))) → 𝐵Ref𝐴)
63	62	ex 418	. . 3 ⊢ (𝑋 = 𝑌 → ((𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)) → 𝐵Ref𝐴))
64	63	exlimdv 1968	. 2 ⊢ (𝑋 = 𝑌 → (∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴)) → 𝐵Ref𝐴))
65	47, 64	impbid 215	1 ⊢ (𝑋 = 𝑌 → (𝐵Ref𝐴 ↔ ∃𝑐(𝐵 ⊆ 𝑐 ∧ (𝐴Fne𝑐 ∧ 𝑐Ref𝐴))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ∪ cuni 4870   class class class wbr 5106  Refcref 23851  Fnecfne 37302

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-topgen 17643  df-ref 23854  df-fne 37303

This theorem is used by: (None)