Theorem unidifsnne 31463

Description: The other element of a pair is not the known element. (Contributed by Thierry Arnoux, 26-Aug-2017.)

Assertion

Ref	Expression
unidifsnne	⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)

Proof of Theorem unidifsnne

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2onn 8588	. . . . . . . . . 10 ⊢ 2o ∈ ω
2		nnfi 9111	. . . . . . . . . 10 ⊢ (2o ∈ ω → 2o ∈ Fin)
3	1, 2	ax-mp 5	. . . . . . . . 9 ⊢ 2o ∈ Fin
4		enfi 9134	. . . . . . . . 9 ⊢ (𝑃 ≈ 2o → (𝑃 ∈ Fin ↔ 2o ∈ Fin))
5	3, 4	mpbiri 257	. . . . . . . 8 ⊢ (𝑃 ≈ 2o → 𝑃 ∈ Fin)
6	5	adantl 482	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 ∈ Fin)
7		diffi 9123	. . . . . . 7 ⊢ (𝑃 ∈ Fin → (𝑃 ∖ {𝑋}) ∈ Fin)
8	6, 7	syl 17	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ∈ Fin)
9	8	cardidd 10485	. . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘(𝑃 ∖ {𝑋})) ≈ (𝑃 ∖ {𝑋}))
10	9	ensymd 8945	. . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ (card‘(𝑃 ∖ {𝑋})))
11		simpl 483	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑋 ∈ 𝑃)
12		dif1card 9946	. . . . . . 7 ⊢ ((𝑃 ∈ Fin ∧ 𝑋 ∈ 𝑃) → (card‘𝑃) = suc (card‘(𝑃 ∖ {𝑋})))
13	6, 11, 12	syl2anc 584	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘𝑃) = suc (card‘(𝑃 ∖ {𝑋})))
14		cardennn 9919	. . . . . . . . 9 ⊢ ((𝑃 ≈ 2o ∧ 2o ∈ ω) → (card‘𝑃) = 2o)
15	1, 14	mpan2 689	. . . . . . . 8 ⊢ (𝑃 ≈ 2o → (card‘𝑃) = 2o)
16		df-2o 8413	. . . . . . . 8 ⊢ 2o = suc 1o
17	15, 16	eqtrdi 2792	. . . . . . 7 ⊢ (𝑃 ≈ 2o → (card‘𝑃) = suc 1o)
18	17	adantl 482	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘𝑃) = suc 1o)
19	13, 18	eqtr3d 2778	. . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → suc (card‘(𝑃 ∖ {𝑋})) = suc 1o)
20		suc11reg 9555	. . . . 5 ⊢ (suc (card‘(𝑃 ∖ {𝑋})) = suc 1o ↔ (card‘(𝑃 ∖ {𝑋})) = 1o)
21	19, 20	sylib 217	. . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘(𝑃 ∖ {𝑋})) = 1o)
22	10, 21	breqtrd 5131	. . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ 1o)
23		en1 8965	. . 3 ⊢ ((𝑃 ∖ {𝑋}) ≈ 1o ↔ ∃𝑥(𝑃 ∖ {𝑋}) = {𝑥})
24	22, 23	sylib 217	. 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∃𝑥(𝑃 ∖ {𝑋}) = {𝑥})
25		simplll 773	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → 𝑋 ∈ 𝑃)
26	25	elexd 3465	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → 𝑋 ∈ V)
27		simplr 767	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → (𝑃 ∖ {𝑋}) = {𝑥})
28		sneqbg 4801	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ 𝑃 → ({𝑋} = {𝑥} ↔ 𝑋 = 𝑥))
29	28	biimpar 478	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑋 = 𝑥) → {𝑋} = {𝑥})
30	29	ad4ant14 750	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → {𝑋} = {𝑥})
31	27, 30	eqtr4d 2779	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → (𝑃 ∖ {𝑋}) = {𝑋})
32	31	ineq2d 4172	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ({𝑋} ∩ (𝑃 ∖ {𝑋})) = ({𝑋} ∩ {𝑋}))
33		disjdif 4431	. . . . . . . . 9 ⊢ ({𝑋} ∩ (𝑃 ∖ {𝑋})) = ∅
34		inidm 4178	. . . . . . . . 9 ⊢ ({𝑋} ∩ {𝑋}) = {𝑋}
35	32, 33, 34	3eqtr3g 2799	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ∅ = {𝑋})
36	35	eqcomd 2742	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → {𝑋} = ∅)
37		snprc 4678	. . . . . . 7 ⊢ (¬ 𝑋 ∈ V ↔ {𝑋} = ∅)
38	36, 37	sylibr 233	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ¬ 𝑋 ∈ V)
39	26, 38	pm2.65da 815	. . . . 5 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ¬ 𝑋 = 𝑥)
40	39	neqned 2950	. . . 4 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → 𝑋 ≠ 𝑥)
41		simpr 485	. . . . . 6 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → (𝑃 ∖ {𝑋}) = {𝑥})
42	41	unieqd 4879	. . . . 5 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) = ∪ {𝑥})
43		unisnv 4888	. . . . 5 ⊢ ∪ {𝑥} = 𝑥
44	42, 43	eqtrdi 2792	. . . 4 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) = 𝑥)
45	40, 44	neeqtrrd 3018	. . 3 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → 𝑋 ≠ ∪ (𝑃 ∖ {𝑋}))
46	45	necomd 2999	. 2 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)
47	24, 46	exlimddv 1938	1 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1541  ∃wex 1781   ∈ wcel 2106   ≠ wne 2943  Vcvv 3445   ∖ cdif 3907   ∩ cin 3909  ∅c0 4282  {csn 4586  ∪ cuni 4865   class class class wbr 5105  suc csuc 6319  ‘cfv 6496  ωcom 7802  1_oc1o 8405  2_oc2o 8406   ≈ cen 8880  Fincfn 8883  cardccrd 9871

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-reg 9528  ax-ac2 10399

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-se 5589  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-riota 7313  df-ov 7360  df-om 7803  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-1o 8412  df-2o 8413  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9875  df-ac 10052

This theorem is referenced by:  cyc3genpmlem  32000