Theorem frinxp 5739

Description: Intersection of well-founded relation with Cartesian product of its field. (Contributed by Mario Carneiro, 10-Jul-2014.)

Assertion

Ref	Expression
frinxp	⊢ (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)

Proof of Theorem frinxp

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssel 3907	. . . . . . . . . . 11 ⊢ (𝑧 ⊆ 𝐴 → (𝑥 ∈ 𝑧 → 𝑥 ∈ 𝐴))
2		ssel 3907	. . . . . . . . . . 11 ⊢ (𝑧 ⊆ 𝐴 → (𝑦 ∈ 𝑧 → 𝑦 ∈ 𝐴))
3	1, 2	anim12d 621	. . . . . . . . . 10 ⊢ (𝑧 ⊆ 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)))
4		brinxp 5735	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
5	4	ancoms 464	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
6	3, 5	syl6 36	. . . . . . . . 9 ⊢ (𝑧 ⊆ 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
7	6	impl 461	. . . . . . . 8 ⊢ (((𝑧 ⊆ 𝐴 ∧ 𝑥 ∈ 𝑧) ∧ 𝑦 ∈ 𝑧) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
8	7	notbid 321	. . . . . . 7 ⊢ (((𝑧 ⊆ 𝐴 ∧ 𝑥 ∈ 𝑧) ∧ 𝑦 ∈ 𝑧) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
9	8	ralbidva 3187	. . . . . 6 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑥 ∈ 𝑧) → (∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
10	9	rexbidva 3188	. . . . 5 ⊢ (𝑧 ⊆ 𝐴 → (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
11	10	adantr 486	. . . 4 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
12	11	pm5.74i 274	. . 3 ⊢ (((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥) ↔ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
13	12	albii 1851	. 2 ⊢ (∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥) ↔ ∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
14		df-fr 5608	. 2 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥))
15		df-fr 5608	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ↔ ∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
16	13, 14, 15	3bitr4i 306	1 ⊢ (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   ∈ wcel 2146   ≠ wne 2959  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281   class class class wbr 5106   Fr wfr 5605   × cxp 5653

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  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 4839  df-br 5107  df-opab 5171  df-fr 5608  df-xp 5661

This theorem is used by:  weinxp  5741