Theorem disjlem17 40100

Description: Lemma for disjdmqseq 40106, partim2 40108 and petlem 40113 via disjlem18 40101, (general version of the former prtlem17 40199). (Contributed by Peter Mazsa, 10-Sep-2021.)

Assertion

Ref	Expression
disjlem17	⊢ ( Disj 𝑅 → ((𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅) → (∃𝑦 ∈ dom 𝑅(𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅) → 𝐵 ∈ [𝑥]𝑅)))

Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑥,𝑅,𝑦

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem disjlem17

Step	Hyp	Ref	Expression
1		df-rex 3091	. . 3 ⊢ (∃𝑦 ∈ dom 𝑅(𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅) ↔ ∃𝑦(𝑦 ∈ dom 𝑅 ∧ (𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅)))
2		an32 659	. . . . . . . 8 ⊢ (((𝑥 ∈ dom 𝑅 ∧ 𝑦 ∈ dom 𝑅) ∧ 𝐴 ∈ [𝑥]𝑅) ↔ ((𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅) ∧ 𝑦 ∈ dom 𝑅))
3		disjlem14 40099	. . . . . . . . . . 11 ⊢ ( Disj 𝑅 → ((𝑥 ∈ dom 𝑅 ∧ 𝑦 ∈ dom 𝑅) → ((𝐴 ∈ [𝑥]𝑅 ∧ 𝐴 ∈ [𝑦]𝑅) → [𝑥]𝑅 = [𝑦]𝑅)))
4		eleq2 2853	. . . . . . . . . . . 12 ⊢ ([𝑥]𝑅 = [𝑦]𝑅 → (𝐵 ∈ [𝑥]𝑅 ↔ 𝐵 ∈ [𝑦]𝑅))
5	4	biimprd 251	. . . . . . . . . . 11 ⊢ ([𝑥]𝑅 = [𝑦]𝑅 → (𝐵 ∈ [𝑦]𝑅 → 𝐵 ∈ [𝑥]𝑅))
6	3, 5	syl8 77	. . . . . . . . . 10 ⊢ ( Disj 𝑅 → ((𝑥 ∈ dom 𝑅 ∧ 𝑦 ∈ dom 𝑅) → ((𝐴 ∈ [𝑥]𝑅 ∧ 𝐴 ∈ [𝑦]𝑅) → (𝐵 ∈ [𝑦]𝑅 → 𝐵 ∈ [𝑥]𝑅))))
7	6	exp4a 437	. . . . . . . . 9 ⊢ ( Disj 𝑅 → ((𝑥 ∈ dom 𝑅 ∧ 𝑦 ∈ dom 𝑅) → (𝐴 ∈ [𝑥]𝑅 → (𝐴 ∈ [𝑦]𝑅 → (𝐵 ∈ [𝑦]𝑅 → 𝐵 ∈ [𝑥]𝑅)))))
8	7	impd 416	. . . . . . . 8 ⊢ ( Disj 𝑅 → (((𝑥 ∈ dom 𝑅 ∧ 𝑦 ∈ dom 𝑅) ∧ 𝐴 ∈ [𝑥]𝑅) → (𝐴 ∈ [𝑦]𝑅 → (𝐵 ∈ [𝑦]𝑅 → 𝐵 ∈ [𝑥]𝑅))))
9	2, 8	biimtrrid 246	. . . . . . 7 ⊢ ( Disj 𝑅 → (((𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅) ∧ 𝑦 ∈ dom 𝑅) → (𝐴 ∈ [𝑦]𝑅 → (𝐵 ∈ [𝑦]𝑅 → 𝐵 ∈ [𝑥]𝑅))))
10	9	expd 421	. . . . . 6 ⊢ ( Disj 𝑅 → ((𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅) → (𝑦 ∈ dom 𝑅 → (𝐴 ∈ [𝑦]𝑅 → (𝐵 ∈ [𝑦]𝑅 → 𝐵 ∈ [𝑥]𝑅)))))
11	10	imp5a 446	. . . . 5 ⊢ ( Disj 𝑅 → ((𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅) → (𝑦 ∈ dom 𝑅 → ((𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅) → 𝐵 ∈ [𝑥]𝑅))))
12	11	imp4b 427	. . . 4 ⊢ (( Disj 𝑅 ∧ (𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅)) → ((𝑦 ∈ dom 𝑅 ∧ (𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅)) → 𝐵 ∈ [𝑥]𝑅))
13	12	exlimdv 1968	. . 3 ⊢ (( Disj 𝑅 ∧ (𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅)) → (∃𝑦(𝑦 ∈ dom 𝑅 ∧ (𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅)) → 𝐵 ∈ [𝑥]𝑅))
14	1, 13	biimtrid 245	. 2 ⊢ (( Disj 𝑅 ∧ (𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅)) → (∃𝑦 ∈ dom 𝑅(𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅) → 𝐵 ∈ [𝑥]𝑅))
15	14	ex 418	1 ⊢ ( Disj 𝑅 → ((𝑥 ∈ dom 𝑅 ∧ 𝐴 ∈ [𝑥]𝑅) → (∃𝑦 ∈ dom 𝑅(𝐴 ∈ [𝑦]𝑅 ∧ 𝐵 ∈ [𝑦]𝑅) → 𝐵 ∈ [𝑥]𝑅)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃wrex 3090  dom cdm 5658  [cec 8753   Disj wdisjALTV 39417

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-sep 5255  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rmo 3369  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ec 8757  df-coss 39699  df-cnvrefrel 39805  df-disjALTV 39988

This theorem is used by:  disjlem18  40101