Theorem oacomf1olem 8597

Description: Lemma for oacomf1o 8598. (Contributed by Mario Carneiro, 30-May-2015.)

Hypothesis

Ref	Expression
oacomf1olem.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥))

Assertion

Ref	Expression
oacomf1olem	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐹:𝐴⟶1-1ontoran 𝐹 ∧ (ran 𝐹 ∩ 𝐵) = ∅))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem oacomf1olem

Step	Hyp	Ref	Expression
1		oaf1o 8596	. . . . . . 7 ⊢ (𝐵 ∈ On → (𝑥 ∈ On ↦ (𝐵 +o 𝑥)):On⟶1-1onto(On ∖ 𝐵))
2	1	adantl 487	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ On ↦ (𝐵 +o 𝑥)):On⟶1-1onto(On ∖ 𝐵))
3		f1of1 6842	. . . . . 6 ⊢ ((𝑥 ∈ On ↦ (𝐵 +o 𝑥)):On⟶1-1onto(On ∖ 𝐵) → (𝑥 ∈ On ↦ (𝐵 +o 𝑥)):On⟶1-1(On ∖ 𝐵))
4	2, 3	syl 18	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ On ↦ (𝐵 +o 𝑥)):On⟶1-1(On ∖ 𝐵))
5		onss 7820	. . . . . 6 ⊢ (𝐴 ∈ On → 𝐴 ⊆ On)
6	5	adantr 486	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ⊆ On)
7		f1ssres 6806	. . . . 5 ⊢ (((𝑥 ∈ On ↦ (𝐵 +o 𝑥)):On⟶1-1(On ∖ 𝐵) ∧ 𝐴 ⊆ On) → ((𝑥 ∈ On ↦ (𝐵 +o 𝑥)) ↾ 𝐴):𝐴⟶1-1(On ∖ 𝐵))
8	4, 6, 7	syl2anc 596	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ On ↦ (𝐵 +o 𝑥)) ↾ 𝐴):𝐴⟶1-1(On ∖ 𝐵))
9	6	resmptd 6043	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ On ↦ (𝐵 +o 𝑥)) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥)))
10		oacomf1olem.1	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐵 +o 𝑥))
11	9, 10	eqtr4di 2816	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥 ∈ On ↦ (𝐵 +o 𝑥)) ↾ 𝐴) = 𝐹)
12		f1eq1 6792	. . . . 5 ⊢ (((𝑥 ∈ On ↦ (𝐵 +o 𝑥)) ↾ 𝐴) = 𝐹 → (((𝑥 ∈ On ↦ (𝐵 +o 𝑥)) ↾ 𝐴):𝐴⟶1-1(On ∖ 𝐵) ↔ 𝐹:𝐴⟶1-1(On ∖ 𝐵)))
13	11, 12	syl 18	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (((𝑥 ∈ On ↦ (𝐵 +o 𝑥)) ↾ 𝐴):𝐴⟶1-1(On ∖ 𝐵) ↔ 𝐹:𝐴⟶1-1(On ∖ 𝐵)))
14	8, 13	mpbid 235	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:𝐴⟶1-1(On ∖ 𝐵))
15		f1f1orn 6855	. . 3 ⊢ (𝐹:𝐴⟶1-1(On ∖ 𝐵) → 𝐹:𝐴⟶1-1ontoran 𝐹)
16	14, 15	syl 18	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:𝐴⟶1-1ontoran 𝐹)
17		f1f 6797	. . . 4 ⊢ (𝐹:𝐴⟶1-1(On ∖ 𝐵) → 𝐹:𝐴⟶(On ∖ 𝐵))
18		frn 6736	. . . 4 ⊢ (𝐹:𝐴⟶(On ∖ 𝐵) → ran 𝐹 ⊆ (On ∖ 𝐵))
19	14, 17, 18	3syl 19	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ran 𝐹 ⊆ (On ∖ 𝐵))
20	19	difss2d 4078	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ran 𝐹 ⊆ On)
21		reldisj 4409	. . . 4 ⊢ (ran 𝐹 ⊆ On → ((ran 𝐹 ∩ 𝐵) = ∅ ↔ ran 𝐹 ⊆ (On ∖ 𝐵)))
22	20, 21	syl 18	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((ran 𝐹 ∩ 𝐵) = ∅ ↔ ran 𝐹 ⊆ (On ∖ 𝐵)))
23	19, 22	mpbird 260	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran 𝐹 ∩ 𝐵) = ∅)
24	16, 23	jca 521	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐹:𝐴⟶1-1ontoran 𝐹 ∧ (ran 𝐹 ∩ 𝐵) = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281   ↦ cmpt 5189  ran crn 5656   ↾ cres 5657  Oncon0 6377  ⟶wf 6551  ⟶1-1wf1 6552  ⟶1-1ontowf1o 6554  (class class class)co 7440   +_o coa 8498

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-oadd 8505

This theorem is used by:  oacomf1o  8598  onadju  10296