Theorem unfilem1 9340

Description: Lemma for proving that the union of two finite sets is finite. (Contributed by NM, 10-Nov-2002.) (Revised by Mario Carneiro, 31-Aug-2015.)

Hypotheses

Ref	Expression
unfilem1.1	⊢ 𝐴 ∈ ω
unfilem1.2	⊢ 𝐵 ∈ ω
unfilem1.3	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))

Assertion

Ref	Expression
unfilem1	⊢ ran 𝐹 = ((𝐴 +o 𝐵) ∖ 𝐴)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem unfilem1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		unfilem1.2	. . . . . . . . . 10 ⊢ 𝐵 ∈ ω
2		elnn 7897	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ ω) → 𝑥 ∈ ω)
3	1, 2	mpan2 691	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → 𝑥 ∈ ω)
4		unfilem1.1	. . . . . . . . . 10 ⊢ 𝐴 ∈ ω
5		nnaord 8655	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (𝑥 ∈ 𝐵 ↔ (𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵)))
6	1, 4, 5	mp3an23 1452	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → (𝑥 ∈ 𝐵 ↔ (𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵)))
7	3, 6	syl 17	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐵 ↔ (𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵)))
8	7	ibi 267	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 → (𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵))
9		nnaword1 8665	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → 𝐴 ⊆ (𝐴 +o 𝑥))
10		nnord 7894	. . . . . . . . . 10 ⊢ (𝐴 ∈ ω → Ord 𝐴)
11		nnacl 8647	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 +o 𝑥) ∈ ω)
12		nnord 7894	. . . . . . . . . . 11 ⊢ ((𝐴 +o 𝑥) ∈ ω → Ord (𝐴 +o 𝑥))
13	11, 12	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → Ord (𝐴 +o 𝑥))
14		ordtri1 6418	. . . . . . . . . 10 ⊢ ((Ord 𝐴 ∧ Ord (𝐴 +o 𝑥)) → (𝐴 ⊆ (𝐴 +o 𝑥) ↔ ¬ (𝐴 +o 𝑥) ∈ 𝐴))
15	10, 13, 14	syl2an2r 685	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ⊆ (𝐴 +o 𝑥) ↔ ¬ (𝐴 +o 𝑥) ∈ 𝐴))
16	9, 15	mpbid 232	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ¬ (𝐴 +o 𝑥) ∈ 𝐴)
17	4, 3, 16	sylancr 587	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 → ¬ (𝐴 +o 𝑥) ∈ 𝐴)
18	8, 17	jca 511	. . . . . 6 ⊢ (𝑥 ∈ 𝐵 → ((𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵) ∧ ¬ (𝐴 +o 𝑥) ∈ 𝐴))
19		eleq1 2826	. . . . . . . 8 ⊢ (𝑦 = (𝐴 +o 𝑥) → (𝑦 ∈ (𝐴 +o 𝐵) ↔ (𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵)))
20		eleq1 2826	. . . . . . . . 9 ⊢ (𝑦 = (𝐴 +o 𝑥) → (𝑦 ∈ 𝐴 ↔ (𝐴 +o 𝑥) ∈ 𝐴))
21	20	notbid 318	. . . . . . . 8 ⊢ (𝑦 = (𝐴 +o 𝑥) → (¬ 𝑦 ∈ 𝐴 ↔ ¬ (𝐴 +o 𝑥) ∈ 𝐴))
22	19, 21	anbi12d 632	. . . . . . 7 ⊢ (𝑦 = (𝐴 +o 𝑥) → ((𝑦 ∈ (𝐴 +o 𝐵) ∧ ¬ 𝑦 ∈ 𝐴) ↔ ((𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵) ∧ ¬ (𝐴 +o 𝑥) ∈ 𝐴)))
23	22	biimparc 479	. . . . . 6 ⊢ ((((𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵) ∧ ¬ (𝐴 +o 𝑥) ∈ 𝐴) ∧ 𝑦 = (𝐴 +o 𝑥)) → (𝑦 ∈ (𝐴 +o 𝐵) ∧ ¬ 𝑦 ∈ 𝐴))
24	18, 23	sylan 580	. . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 = (𝐴 +o 𝑥)) → (𝑦 ∈ (𝐴 +o 𝐵) ∧ ¬ 𝑦 ∈ 𝐴))
25	24	rexlimiva 3144	. . . 4 ⊢ (∃𝑥 ∈ 𝐵 𝑦 = (𝐴 +o 𝑥) → (𝑦 ∈ (𝐴 +o 𝐵) ∧ ¬ 𝑦 ∈ 𝐴))
26	4, 1	nnacli 8650	. . . . . . . 8 ⊢ (𝐴 +o 𝐵) ∈ ω
27		elnn 7897	. . . . . . . 8 ⊢ ((𝑦 ∈ (𝐴 +o 𝐵) ∧ (𝐴 +o 𝐵) ∈ ω) → 𝑦 ∈ ω)
28	26, 27	mpan2 691	. . . . . . 7 ⊢ (𝑦 ∈ (𝐴 +o 𝐵) → 𝑦 ∈ ω)
29		nnord 7894	. . . . . . . . 9 ⊢ (𝑦 ∈ ω → Ord 𝑦)
30		ordtri1 6418	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ Ord 𝑦) → (𝐴 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝐴))
31	10, 29, 30	syl2an 596	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝐴))
32		nnawordex 8673	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 ⊆ 𝑦 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝑦))
33	31, 32	bitr3d 281	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (¬ 𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝑦))
34	4, 28, 33	sylancr 587	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 +o 𝐵) → (¬ 𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝑦))
35		eleq1 2826	. . . . . . . . . 10 ⊢ ((𝐴 +o 𝑥) = 𝑦 → ((𝐴 +o 𝑥) ∈ (𝐴 +o 𝐵) ↔ 𝑦 ∈ (𝐴 +o 𝐵)))
36	6, 35	sylan9bb 509	. . . . . . . . 9 ⊢ ((𝑥 ∈ ω ∧ (𝐴 +o 𝑥) = 𝑦) → (𝑥 ∈ 𝐵 ↔ 𝑦 ∈ (𝐴 +o 𝐵)))
37	36	biimprcd 250	. . . . . . . 8 ⊢ (𝑦 ∈ (𝐴 +o 𝐵) → ((𝑥 ∈ ω ∧ (𝐴 +o 𝑥) = 𝑦) → 𝑥 ∈ 𝐵))
38		eqcom 2741	. . . . . . . . . 10 ⊢ ((𝐴 +o 𝑥) = 𝑦 ↔ 𝑦 = (𝐴 +o 𝑥))
39	38	biimpi 216	. . . . . . . . 9 ⊢ ((𝐴 +o 𝑥) = 𝑦 → 𝑦 = (𝐴 +o 𝑥))
40	39	adantl 481	. . . . . . . 8 ⊢ ((𝑥 ∈ ω ∧ (𝐴 +o 𝑥) = 𝑦) → 𝑦 = (𝐴 +o 𝑥))
41	37, 40	jca2 513	. . . . . . 7 ⊢ (𝑦 ∈ (𝐴 +o 𝐵) → ((𝑥 ∈ ω ∧ (𝐴 +o 𝑥) = 𝑦) → (𝑥 ∈ 𝐵 ∧ 𝑦 = (𝐴 +o 𝑥))))
42	41	reximdv2 3161	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 +o 𝐵) → (∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝑦 → ∃𝑥 ∈ 𝐵 𝑦 = (𝐴 +o 𝑥)))
43	34, 42	sylbid 240	. . . . 5 ⊢ (𝑦 ∈ (𝐴 +o 𝐵) → (¬ 𝑦 ∈ 𝐴 → ∃𝑥 ∈ 𝐵 𝑦 = (𝐴 +o 𝑥)))
44	43	imp 406	. . . 4 ⊢ ((𝑦 ∈ (𝐴 +o 𝐵) ∧ ¬ 𝑦 ∈ 𝐴) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐴 +o 𝑥))
45	25, 44	impbii 209	. . 3 ⊢ (∃𝑥 ∈ 𝐵 𝑦 = (𝐴 +o 𝑥) ↔ (𝑦 ∈ (𝐴 +o 𝐵) ∧ ¬ 𝑦 ∈ 𝐴))
46		unfilem1.3	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝐴 +o 𝑥))
47		ovex 7463	. . . 4 ⊢ (𝐴 +o 𝑥) ∈ V
48	46, 47	elrnmpti 5975	. . 3 ⊢ (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐵 𝑦 = (𝐴 +o 𝑥))
49		eldif 3972	. . 3 ⊢ (𝑦 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝑦 ∈ (𝐴 +o 𝐵) ∧ ¬ 𝑦 ∈ 𝐴))
50	45, 48, 49	3bitr4i 303	. 2 ⊢ (𝑦 ∈ ran 𝐹 ↔ 𝑦 ∈ ((𝐴 +o 𝐵) ∖ 𝐴))
51	50	eqriv 2731	1 ⊢ ran 𝐹 = ((𝐴 +o 𝐵) ∖ 𝐴)

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   = wceq 1536   ∈ wcel 2105  ∃wrex 3067   ∖ cdif 3959   ⊆ wss 3962   ↦ cmpt 5230  ran crn 5689  Ord word 6384  (class class class)co 7430  ωcom 7886   +_o coa 8501

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437  ax-un 7753

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-pss 3982  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-iun 4997  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-we 5642  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-pred 6322  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7887  df-2nd 8013  df-frecs 8304  df-wrecs 8335  df-recs 8409  df-rdg 8448  df-oadd 8508

This theorem is referenced by:  unfilem2  9341