Metamath Proof Explorer


Theorem unxpdomlem3

Description: Lemma for unxpdom . (Contributed by Mario Carneiro, 13-Jan-2013) (Revised by Mario Carneiro, 16-Nov-2014)

Ref Expression
Hypotheses unxpdomlem1.1 ⊢ F = x ∈ a ∪ b ⟼ G
unxpdomlem1.2 ⊢ G = if x ∈ a x if x = m t s if x = t n m x
Assertion unxpdomlem3 ⊢ 1 𝑜 ≺ a ∧ 1 𝑜 ≺ b → a ∪ b ≼ a × b

Proof

Step Hyp Ref Expression
1 unxpdomlem1.1 ⊢ F = x ∈ a ∪ b ⟼ G
2 unxpdomlem1.2 ⊢ G = if x ∈ a x if x = m t s if x = t n m x
3 1sdom ⊢ a ∈ V → 1 𝑜 ≺ a ↔ ∃ m ∈ a ∃ n ∈ a ¬ m = n
4 3 elv ⊢ 1 𝑜 ≺ a ↔ ∃ m ∈ a ∃ n ∈ a ¬ m = n
5 1sdom ⊢ b ∈ V → 1 𝑜 ≺ b ↔ ∃ s ∈ b ∃ t ∈ b ¬ s = t
6 5 elv ⊢ 1 𝑜 ≺ b ↔ ∃ s ∈ b ∃ t ∈ b ¬ s = t
7 reeanv ⊢ ∃ m ∈ a ∃ s ∈ b ∃ n ∈ a ¬ m = n ∧ ∃ t ∈ b ¬ s = t ↔ ∃ m ∈ a ∃ n ∈ a ¬ m = n ∧ ∃ s ∈ b ∃ t ∈ b ¬ s = t
8 reeanv ⊢ ∃ n ∈ a ∃ t ∈ b ¬ m = n ∧ ¬ s = t ↔ ∃ n ∈ a ¬ m = n ∧ ∃ t ∈ b ¬ s = t
9 vex ⊢ a ∈ V
10 vex ⊢ b ∈ V
11 9 10 unex ⊢ a ∪ b ∈ V
12 9 10 xpex ⊢ a × b ∈ V
13 simpr ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b ∧ x ∈ a → x ∈ a
14 simp2r ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → t ∈ b
15 simp1r ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → s ∈ b
16 14 15 ifcld ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → if x = m t s ∈ b
17 16 ad2antrr ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b ∧ x ∈ a → if x = m t s ∈ b
18 13 17 opelxpd ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b ∧ x ∈ a → x if x = m t s ∈ a × b
19 simp2l ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → n ∈ a
20 simp1l ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → m ∈ a
21 19 20 ifcld ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → if x = t n m ∈ a
22 21 ad2antrr ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b ∧ ¬ x ∈ a → if x = t n m ∈ a
23 elun ⊢ x ∈ a ∪ b ↔ x ∈ a ∨ x ∈ b
24 23 bilani ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b → x ∈ a ∨ x ∈ b
25 24 orcanai ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b ∧ ¬ x ∈ a → x ∈ b
26 22 25 opelxpd ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b ∧ ¬ x ∈ a → if x = t n m x ∈ a × b
27 18 26 ifclda ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b → if x ∈ a x if x = m t s if x = t n m x ∈ a × b
28 2 27 eqeltrid ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t ∧ x ∈ a ∪ b → G ∈ a × b
29 28 1 fmptd ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → F : a ∪ b ⟶ a × b
30 1 2 unxpdomlem1 ⊢ z ∈ a ∪ b → F ⁡ z = if z ∈ a z if z = m t s if z = t n m z
31 30 ad2antrl ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b → F ⁡ z = if z ∈ a z if z = m t s if z = t n m z
32 iftrue ⊢ z ∈ a → if z ∈ a z if z = m t s if z = t n m z = z if z = m t s
33 32 adantr ⊢ z ∈ a ∧ w ∈ a → if z ∈ a z if z = m t s if z = t n m z = z if z = m t s
34 31 33 sylan9eq ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ z ∈ a ∧ w ∈ a → F ⁡ z = z if z = m t s
35 1 2 unxpdomlem1 ⊢ w ∈ a ∪ b → F ⁡ w = if w ∈ a w if w = m t s if w = t n m w
36 35 ad2antll ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b → F ⁡ w = if w ∈ a w if w = m t s if w = t n m w
37 iftrue ⊢ w ∈ a → if w ∈ a w if w = m t s if w = t n m w = w if w = m t s
38 37 adantl ⊢ z ∈ a ∧ w ∈ a → if w ∈ a w if w = m t s if w = t n m w = w if w = m t s
39 36 38 sylan9eq ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ z ∈ a ∧ w ∈ a → F ⁡ w = w if w = m t s
40 34 39 eqeq12d ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ z ∈ a ∧ w ∈ a → F ⁡ z = F ⁡ w ↔ z if z = m t s = w if w = m t s
41 vex ⊢ z ∈ V
42 vex ⊢ t ∈ V
43 vex ⊢ s ∈ V
44 42 43 ifex ⊢ if z = m t s ∈ V
45 41 44 opth1 ⊢ z if z = m t s = w if w = m t s → z = w
46 40 45 biimtrdi ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ z ∈ a ∧ w ∈ a → F ⁡ z = F ⁡ w → z = w
47 simprr ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b → w ∈ a ∪ b
48 simpll ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b → ¬ m = n
49 simplr ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b → ¬ s = t
50 1 2 47 48 49 unxpdomlem2 ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ z ∈ a ∧ ¬ w ∈ a → ¬ F ⁡ z = F ⁡ w
51 50 pm2.21d ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ z ∈ a ∧ ¬ w ∈ a → F ⁡ z = F ⁡ w → z = w
52 eqcom ⊢ F ⁡ z = F ⁡ w ↔ F ⁡ w = F ⁡ z
53 simprl ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b → z ∈ a ∪ b
54 1 2 53 48 49 unxpdomlem2 ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ w ∈ a ∧ ¬ z ∈ a → ¬ F ⁡ w = F ⁡ z
55 54 ancom2s ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ ¬ z ∈ a ∧ w ∈ a → ¬ F ⁡ w = F ⁡ z
56 55 pm2.21d ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ ¬ z ∈ a ∧ w ∈ a → F ⁡ w = F ⁡ z → z = w
57 52 56 biimtrid ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ ¬ z ∈ a ∧ w ∈ a → F ⁡ z = F ⁡ w → z = w
58 iffalse ⊢ ¬ z ∈ a → if z ∈ a z if z = m t s if z = t n m z = if z = t n m z
59 58 adantr ⊢ ¬ z ∈ a ∧ ¬ w ∈ a → if z ∈ a z if z = m t s if z = t n m z = if z = t n m z
60 31 59 sylan9eq ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ ¬ z ∈ a ∧ ¬ w ∈ a → F ⁡ z = if z = t n m z
61 iffalse ⊢ ¬ w ∈ a → if w ∈ a w if w = m t s if w = t n m w = if w = t n m w
62 61 adantl ⊢ ¬ z ∈ a ∧ ¬ w ∈ a → if w ∈ a w if w = m t s if w = t n m w = if w = t n m w
63 36 62 sylan9eq ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ ¬ z ∈ a ∧ ¬ w ∈ a → F ⁡ w = if w = t n m w
64 60 63 eqeq12d ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ ¬ z ∈ a ∧ ¬ w ∈ a → F ⁡ z = F ⁡ w ↔ if z = t n m z = if w = t n m w
65 vex ⊢ n ∈ V
66 vex ⊢ m ∈ V
67 65 66 ifex ⊢ if z = t n m ∈ V
68 67 41 opth ⊢ if z = t n m z = if w = t n m w ↔ if z = t n m = if w = t n m ∧ z = w
69 68 simprbi ⊢ if z = t n m z = if w = t n m w → z = w
70 64 69 biimtrdi ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b ∧ ¬ z ∈ a ∧ ¬ w ∈ a → F ⁡ z = F ⁡ w → z = w
71 46 51 57 70 4casesdan ⊢ ¬ m = n ∧ ¬ s = t ∧ z ∈ a ∪ b ∧ w ∈ a ∪ b → F ⁡ z = F ⁡ w → z = w
72 71 ralrimivva ⊢ ¬ m = n ∧ ¬ s = t → ∀ z ∈ a ∪ b ∀ w ∈ a ∪ b F ⁡ z = F ⁡ w → z = w
73 72 3ad2ant3 ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → ∀ z ∈ a ∪ b ∀ w ∈ a ∪ b F ⁡ z = F ⁡ w → z = w
74 dff13 ⊢ F : a ∪ b ⟶ 1-1 a × b ↔ F : a ∪ b ⟶ a × b ∧ ∀ z ∈ a ∪ b ∀ w ∈ a ∪ b F ⁡ z = F ⁡ w → z = w
75 29 73 74 sylanbrc ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → F : a ∪ b ⟶ 1-1 a × b
76 f1dom2g ⊢ a ∪ b ∈ V ∧ a × b ∈ V ∧ F : a ∪ b ⟶ 1-1 a × b → a ∪ b ≼ a × b
77 11 12 75 76 mp3an12i ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b ∧ ¬ m = n ∧ ¬ s = t → a ∪ b ≼ a × b
78 77 3expia ⊢ m ∈ a ∧ s ∈ b ∧ n ∈ a ∧ t ∈ b → ¬ m = n ∧ ¬ s = t → a ∪ b ≼ a × b
79 78 rexlimdvva ⊢ m ∈ a ∧ s ∈ b → ∃ n ∈ a ∃ t ∈ b ¬ m = n ∧ ¬ s = t → a ∪ b ≼ a × b
80 8 79 biimtrrid ⊢ m ∈ a ∧ s ∈ b → ∃ n ∈ a ¬ m = n ∧ ∃ t ∈ b ¬ s = t → a ∪ b ≼ a × b
81 80 rexlimivv ⊢ ∃ m ∈ a ∃ s ∈ b ∃ n ∈ a ¬ m = n ∧ ∃ t ∈ b ¬ s = t → a ∪ b ≼ a × b
82 7 81 sylbir ⊢ ∃ m ∈ a ∃ n ∈ a ¬ m = n ∧ ∃ s ∈ b ∃ t ∈ b ¬ s = t → a ∪ b ≼ a × b
83 4 6 82 syl2anb ⊢ 1 𝑜 ≺ a ∧ 1 𝑜 ≺ b → a ∪ b ≼ a × b