Theorem unidifsnne 32882

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 8624	. . . . . . . . . 10 ⊢ 2o ∈ ω
2		nnfi 9148	. . . . . . . . . 10 ⊢ (2o ∈ ω → 2o ∈ Fin)
3	1, 2	ax-mp 5	. . . . . . . . 9 ⊢ 2o ∈ Fin
4		enfi 9167	. . . . . . . . 9 ⊢ (𝑃 ≈ 2o → (𝑃 ∈ Fin ↔ 2o ∈ Fin))
5	3, 4	mpbiri 261	. . . . . . . 8 ⊢ (𝑃 ≈ 2o → 𝑃 ∈ Fin)
6	5	adantl 486	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑃 ∈ Fin)
7		diffi 9155	. . . . . . 7 ⊢ (𝑃 ∈ Fin → (𝑃 ∖ {𝑋}) ∈ Fin)
8	6, 7	syl 18	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ∈ Fin)
9	8	cardidd 10528	. . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘(𝑃 ∖ {𝑋})) ≈ (𝑃 ∖ {𝑋}))
10	9	ensymd 8998	. . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ (card‘(𝑃 ∖ {𝑋})))
11		simpl 487	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → 𝑋 ∈ 𝑃)
12		dif1card 9990	. . . . . . 7 ⊢ ((𝑃 ∈ Fin ∧ 𝑋 ∈ 𝑃) → (card‘𝑃) = suc (card‘(𝑃 ∖ {𝑋})))
13	6, 11, 12	syl2anc 595	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘𝑃) = suc (card‘(𝑃 ∖ {𝑋})))
14		cardennn 9965	. . . . . . . . 9 ⊢ ((𝑃 ≈ 2o ∧ 2o ∈ ω) → (card‘𝑃) = 2o)
15	1, 14	mpan2 703	. . . . . . . 8 ⊢ (𝑃 ≈ 2o → (card‘𝑃) = 2o)
16		df-2o 8450	. . . . . . . 8 ⊢ 2o = suc 1o
17	15, 16	eqtrdi 2814	. . . . . . 7 ⊢ (𝑃 ≈ 2o → (card‘𝑃) = suc 1o)
18	17	adantl 486	. . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘𝑃) = suc 1o)
19	13, 18	eqtr3d 2800	. . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → suc (card‘(𝑃 ∖ {𝑋})) = suc 1o)
20		suc11reg 9584	. . . . 5 ⊢ (suc (card‘(𝑃 ∖ {𝑋})) = suc 1o ↔ (card‘(𝑃 ∖ {𝑋})) = 1o)
21	19, 20	sylib 221	. . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (card‘(𝑃 ∖ {𝑋})) = 1o)
22	10, 21	breqtrd 5137	. . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → (𝑃 ∖ {𝑋}) ≈ 1o)
23		en1 9017	. . 3 ⊢ ((𝑃 ∖ {𝑋}) ≈ 1o ↔ ∃𝑥(𝑃 ∖ {𝑋}) = {𝑥})
24	22, 23	sylib 221	. 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∃𝑥(𝑃 ∖ {𝑋}) = {𝑥})
25		simplll 786	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → 𝑋 ∈ 𝑃)
26	25	elexd 3478	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → 𝑋 ∈ V)
27		simplr 780	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → (𝑃 ∖ {𝑋}) = {𝑥})
28		sneqbg 4808	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ 𝑃 → ({𝑋} = {𝑥} ↔ 𝑋 = 𝑥))
29	28	biimpar 482	. . . . . . . . . . . 12 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑋 = 𝑥) → {𝑋} = {𝑥})
30	29	ad4ant14 764	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → {𝑋} = {𝑥})
31	27, 30	eqtr4d 2801	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → (𝑃 ∖ {𝑋}) = {𝑋})
32	31	ineq2d 4173	. . . . . . . . 9 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ({𝑋} ∩ (𝑃 ∖ {𝑋})) = ({𝑋} ∩ {𝑋}))
33		disjdif 4433	. . . . . . . . 9 ⊢ ({𝑋} ∩ (𝑃 ∖ {𝑋})) = ∅
34		inidm 4179	. . . . . . . . 9 ⊢ ({𝑋} ∩ {𝑋}) = {𝑋}
35	32, 33, 34	3eqtr3g 2821	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ∅ = {𝑋})
36	35	eqcomd 2769	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → {𝑋} = ∅)
37		snprc 4683	. . . . . . 7 ⊢ (¬ 𝑋 ∈ V ↔ {𝑋} = ∅)
38	36, 37	sylibr 237	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) ∧ 𝑋 = 𝑥) → ¬ 𝑋 ∈ V)
39	26, 38	pm2.65da 828	. . . . 5 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ¬ 𝑋 = 𝑥)
40	39	neqned 2965	. . . 4 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → 𝑋 ≠ 𝑥)
41		simpr 489	. . . . . 6 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → (𝑃 ∖ {𝑋}) = {𝑥})
42	41	unieqd 4885	. . . . 5 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) = ∪ {𝑥})
43		unisnv 4892	. . . . 5 ⊢ ∪ {𝑥} = 𝑥
44	42, 43	eqtrdi 2814	. . . 4 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) = 𝑥)
45	40, 44	neeqtrrd 3032	. . 3 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → 𝑋 ≠ ∪ (𝑃 ∖ {𝑋}))
46	45	necomd 3013	. 2 ⊢ (((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) ∧ (𝑃 ∖ {𝑋}) = {𝑥}) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)
47	24, 46	exlimddv 1965	1 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑃 ≈ 2o) → ∪ (𝑃 ∖ {𝑋}) ≠ 𝑋)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1570  ∃wex 1809   ∈ wcel 2143   ≠ wne 2958  Vcvv 3455   ∖ cdif 3902   ∩ cin 3904  ∅c0 4286  {csn 4589  ∪ cuni 4872   class class class wbr 5109  suc csuc 6362  ‘cfv 6536  ωcom 7858  1_oc1o 8442  2_oc2o 8443   ≈ cen 8936  Fincfn 8939  cardccrd 9917

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-reg 9550  ax-ac2 10442

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-1o 8449  df-2o 8450  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-card 9921  df-ac 10096

This theorem is referenced by:  cyc3genpmlem  33471