Theorem unidifsnne 32823

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 8628	. . . . . . . . . 10 ⊢ 2o ∈ ω
2		nnfi 9152	. . . . . . . . . 10 ⊢ (2o ∈ ω → 2o ∈ Fin)
3	1, 2	ax-mp 5	. . . . . . . . 9 ⊢ 2o ∈ Fin
4		enfi 9171	. . . . . . . . 9 ⊢ (𝑃 ≈ 2o → (𝑃 ∈ Fin ↔ 2o ∈ Fin))
5	3, 4	mpbiri 261	. . . . . . . 8 ⊢ (𝑃 ≈ 2o → 𝑃 ∈ Fin)
6	5	adantl 486	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 ∈ Fin)
7		diffi 9159	. . . . . . 7 ⊢ (𝑃 ∈ Fin → (𝑃 ∖ {𝑋}) ∈ Fin)
8	6, 7	syl 18	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ∈ Fin)
9	8	cardidd 10533	. . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘(𝑃 ∖ {𝑋})) ≈ (𝑃 ∖ {𝑋}))
10	9	ensymd 9002	. . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ (card‘(𝑃 ∖ {𝑋})))
11		simpl 487	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑋 ∈ 𝑃)
12		dif1card 9994	. . . . . . 7 ⊢ ((𝑃 ∈ Fin ∧ 𝑋 ∈ 𝑃) → (card‘𝑃) = suc (card‘(𝑃 ∖ {𝑋})))
13	6, 11, 12	syl2anc 595	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘𝑃) = suc (card‘(𝑃 ∖ {𝑋})))
14		cardennn 9969	. . . . . . . . 9 ⊢ ((𝑃 ≈ 2o ∧ 2o ∈ ω) → (card‘𝑃) = 2o)
15	1, 14	mpan2 703	. . . . . . . 8 ⊢ (𝑃 ≈ 2o → (card‘𝑃) = 2o)
16		df-2o 8454	. . . . . . . 8 ⊢ 2o = suc 1o
17	15, 16	eqtrdi 2820	. . . . . . 7 ⊢ (𝑃 ≈ 2o → (card‘𝑃) = suc 1o)
18	17	adantl 486	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘𝑃) = suc 1o)
19	13, 18	eqtr3d 2806	. . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → suc (card‘(𝑃 ∖ {𝑋})) = suc 1o)
20		suc11reg 9588	. . . . 5 ⊢ (suc (card‘(𝑃 ∖ {𝑋})) = suc 1o ↔ (card‘(𝑃 ∖ {𝑋})) = 1o)
21	19, 20	sylib 221	. . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘(𝑃 ∖ {𝑋})) = 1o)
22	10, 21	breqtrd 5141	. . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ 1o)
23		en1 9021	. . 3 ⊢ ((𝑃 ∖ {𝑋}) ≈ 1o ↔ ∃𝑥(𝑃 ∖ {𝑋}) = {𝑥})
24	22, 23	sylib 221	. 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∃𝑥(𝑃 ∖ {𝑋}) = {𝑥})
25		simplll 786	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → 𝑋 ∈ 𝑃)
26	25	elexd 3486	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → 𝑋 ∈ V)
27		simplr 780	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → (𝑃 ∖ {𝑋}) = {𝑥})
28		sneqbg 4812	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ 𝑃 → ({𝑋} = {𝑥} ↔ 𝑋 = 𝑥))
29	28	biimpar 482	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑋 = 𝑥) → {𝑋} = {𝑥})
30	29	ad4ant14 764	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → {𝑋} = {𝑥})
31	27, 30	eqtr4d 2807	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → (𝑃 ∖ {𝑋}) = {𝑋})
32	31	ineq2d 4181	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ({𝑋} ∩ (𝑃 ∖ {𝑋})) = ({𝑋} ∩ {𝑋}))
33		disjdif 4438	. . . . . . . . 9 ⊢ ({𝑋} ∩ (𝑃 ∖ {𝑋})) = ∅
34		inidm 4187	. . . . . . . . 9 ⊢ ({𝑋} ∩ {𝑋}) = {𝑋}
35	32, 33, 34	3eqtr3g 2827	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ∅ = {𝑋})
36	35	eqcomd 2775	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → {𝑋} = ∅)
37		snprc 4688	. . . . . . 7 ⊢ (¬ 𝑋 ∈ V ↔ {𝑋} = ∅)
38	36, 37	sylibr 237	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ¬ 𝑋 ∈ V)
39	26, 38	pm2.65da 828	. . . . 5 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ¬ 𝑋 = 𝑥)
40	39	neqned 2971	. . . 4 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → 𝑋 ≠ 𝑥)
41		simpr 489	. . . . . 6 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → (𝑃 ∖ {𝑋}) = {𝑥})
42	41	unieqd 4889	. . . . 5 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) = ∪ {𝑥})
43		unisnv 4896	. . . . 5 ⊢ ∪ {𝑥} = 𝑥
44	42, 43	eqtrdi 2820	. . . 4 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) = 𝑥)
45	40, 44	neeqtrrd 3038	. . 3 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → 𝑋 ≠ ∪ (𝑃 ∖ {𝑋}))
46	45	necomd 3019	. 2 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)
47	24, 46	exlimddv 1962	1 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1567  ∃wex 1806   ∈ wcel 2149   ≠ wne 2964  Vcvv 3463   ∖ cdif 3910   ∩ cin 3912  ∅c0 4294  {csn 4594  ∪ cuni 4876   class class class wbr 5113  suc csuc 6363  ‘cfv 6537  ωcom 7862  1_oc1o 8446  2_oc2o 8447   ≈ cen 8940  Fincfn 8943  cardccrd 9921

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-reg 9554  ax-ac2 10447

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7368  df-ov 7414  df-om 7863  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-1o 8453  df-2o 8454  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-card 9925  df-ac 10100

This theorem is referenced by:  cyc3genpmlem  33412