Metamath Proof Explorer


Theorem unidifsnne

Description: The other element of a pair is not the known element. (Contributed by Thierry Arnoux, 26-Aug-2017) Remove dependency on ax-reg . (Revised by Timothy J. O'Malley, 15-Oct-2026)

Ref Expression
Assertion unidifsnne ⊢ X ∈ P ∧ P ≈ 2 𝑜 → ⋃ P ∖ X ≠ X

Proof

Step Hyp Ref Expression
1 2onn ⊢ 2 𝑜 ∈ ω
2 nnfi ⊢ 2 𝑜 ∈ ω → 2 𝑜 ∈ Fin
3 1 2 ax-mp ⊢ 2 𝑜 ∈ Fin
4 enfi ⊢ P ≈ 2 𝑜 → P ∈ Fin ↔ 2 𝑜 ∈ Fin
5 3 4 mpbiri ⊢ P ≈ 2 𝑜 → P ∈ Fin
6 5 adantl ⊢ X ∈ P ∧ P ≈ 2 𝑜 → P ∈ Fin
7 diffi ⊢ P ∈ Fin → P ∖ X ∈ Fin
8 6 7 syl ⊢ X ∈ P ∧ P ≈ 2 𝑜 → P ∖ X ∈ Fin
9 8 cardidd ⊢ X ∈ P ∧ P ≈ 2 𝑜 → card ⁡ P ∖ X ≈ P ∖ X
10 9 ensymd ⊢ X ∈ P ∧ P ≈ 2 𝑜 → P ∖ X ≈ card ⁡ P ∖ X
11 simpl ⊢ X ∈ P ∧ P ≈ 2 𝑜 → X ∈ P
12 dif1card ⊢ P ∈ Fin ∧ X ∈ P → card ⁡ P = suc ⁡ card ⁡ P ∖ X
13 6 11 12 syl2anc ⊢ X ∈ P ∧ P ≈ 2 𝑜 → card ⁡ P = suc ⁡ card ⁡ P ∖ X
14 cardennn ⊢ P ≈ 2 𝑜 ∧ 2 𝑜 ∈ ω → card ⁡ P = 2 𝑜
15 1 14 mpan2 ⊢ P ≈ 2 𝑜 → card ⁡ P = 2 𝑜
16 df-2o ⊢ 2 𝑜 = suc ⁡ 1 𝑜
17 15 16 eqtrdi ⊢ P ≈ 2 𝑜 → card ⁡ P = suc ⁡ 1 𝑜
18 17 adantl ⊢ X ∈ P ∧ P ≈ 2 𝑜 → card ⁡ P = suc ⁡ 1 𝑜
19 13 18 eqtr3d ⊢ X ∈ P ∧ P ≈ 2 𝑜 → suc ⁡ card ⁡ P ∖ X = suc ⁡ 1 𝑜
20 cardon ⊢ card ⁡ P ∖ X ∈ On
21 1on ⊢ 1 𝑜 ∈ On
22 suc11 ⊢ card ⁡ P ∖ X ∈ On ∧ 1 𝑜 ∈ On → suc ⁡ card ⁡ P ∖ X = suc ⁡ 1 𝑜 ↔ card ⁡ P ∖ X = 1 𝑜
23 20 21 22 mp2an ⊢ suc ⁡ card ⁡ P ∖ X = suc ⁡ 1 𝑜 ↔ card ⁡ P ∖ X = 1 𝑜
24 19 23 sylib ⊢ X ∈ P ∧ P ≈ 2 𝑜 → card ⁡ P ∖ X = 1 𝑜
25 10 24 breqtrd ⊢ X ∈ P ∧ P ≈ 2 𝑜 → P ∖ X ≈ 1 𝑜
26 en1 ⊢ P ∖ X ≈ 1 𝑜 ↔ ∃ x P ∖ X = x
27 25 26 sylib ⊢ X ∈ P ∧ P ≈ 2 𝑜 → ∃ x P ∖ X = x
28 simplll ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → X ∈ P
29 28 elexd ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → X ∈ V
30 simplr ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → P ∖ X = x
31 sneqbg ⊢ X ∈ P → X = x ↔ X = x
32 31 biimpar ⊢ X ∈ P ∧ X = x → X = x
33 32 ad4ant14 ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → X = x
34 30 33 eqtr4d ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → P ∖ X = X
35 34 ineq2d ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → X ∩ P ∖ X = X ∩ X
36 disjdif ⊢ X ∩ P ∖ X = ∅
37 inidm ⊢ X ∩ X = X
38 35 36 37 3eqtr3g ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → ∅ = X
39 38 eqcomd ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → X = ∅
40 snprc ⊢ ¬ X ∈ V ↔ X = ∅
41 39 40 sylibr ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x ∧ X = x → ¬ X ∈ V
42 29 41 pm2.65da ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x → ¬ X = x
43 42 neqned ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x → X ≠ x
44 simpr ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x → P ∖ X = x
45 44 unieqd ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x → ⋃ P ∖ X = ⋃ x
46 unisnv ⊢ ⋃ x = x
47 45 46 eqtrdi ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x → ⋃ P ∖ X = x
48 43 47 neeqtrrd ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x → X ≠ ⋃ P ∖ X
49 48 necomd ⊢ X ∈ P ∧ P ≈ 2 𝑜 ∧ P ∖ X = x → ⋃ P ∖ X ≠ X
50 27 49 exlimddv ⊢ X ∈ P ∧ P ≈ 2 𝑜 → ⋃ P ∖ X ≠ X